Heuristic Algorithms for Parallel Machine Scheduling Problems with Dividable Jobs
نویسندگان
چکیده
منابع مشابه
Heuristic algorithms for a complex parallel machine scheduling problem
In this work we present a new scheduling model for parallel machines, which extends the multiprocessor scheduling problem with release times for minimizing the total tardiness, and also extends the problem of vehicle routing with time windows. This new model is motivated by a resource allocation problem which appears in the service sector. We present two class of heuristic algorithms for the so...
متن کاملScatter Search Algorithms for Identical Parallel Machine Scheduling Problems
We address the Identical Parallel Machine Scheduling Problem, one of the most important basic problems in scheduling theory, and some generalizations of it arising from real world situations. We survey the current state of the art for the most performing meta-heuristic algorithms for this class of problems, with special emphasis on recent results obtained through Scatter Search. We present insi...
متن کاملGENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS
This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملHeuristic Algorithms For Scheduling Jobs On Identical Parallel Machines Via Measures Of Spread
Constructive heuristics for the scheduling problem of n independent jobs on m identical parallel machines with minimum makespan objective are described. The proposed algorithms, which are n log n algorithms as the LPT algorithm of Graham, iteratively combine partial solutions that are obtained by partitioning the set of jobs into suitable families of subsets. The procedure used to partition the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Industrial Engineering and Management Systems
سال: 2011
ISSN: 1598-7248
DOI: 10.7232/iems.2011.10.1.015